TC operations and Latin bricks
نویسندگان
چکیده
منابع مشابه
Building Bricks with Bricks, with Mathematica
In this work we solve a special case of the problem of building an n-dimensional parallelepiped using a given set of n-dimensional parallelepipeds. Consider the identity x = xHx 1L Hx 2L + 3 xHx 1L + x. For sufficiently large x, we associate with x3 a cube with edges of size x, with x Hx 1L Hx 2L a parallelepiped with edges x, x 1, x 2, with 3 x Hx 1L three parallelepipeds of edges x, x 1, 1, a...
متن کاملMinimal bricks
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletion of e results in a graph that is not a brick. We prove a generation theorem for minimal bricks and two corollaries: (1) for n ≥ 5, every minimal brick on 2n vertices has at most 5n − 7 edges, and (2) every minimal br...
متن کاملThe bitwise operations in relation to obtaining Latin squares
This article outlines some techniques for the use of bitwise operations in programming languages C/C++ and Java. As an example, we describe an algorithm for receiving a Latin square of arbitrary order.
متن کاملOperations Research on Promoting Vasectomy in Three Latin American Countries
The situation in Mexico followed a similar pattern. From 1980 to 1988, the Mexican Social Security Institute (the Instituto Mexicano de Seguro Social, or IMSS) performed fewer than 5,000 vasectomies per year. In 1989, the IMSS launched a program to open at least one no-scalpel vasectomy training center in each state. By September 1994, 44 centers had been established, 116 physicians had been tr...
متن کاملGenerating bricks
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. Bricks are building blocks of the matching decomposition procedure of Kotzig, Lovasz and Plummer, and therefore many matching-related problems can be reduced to bricks. We prove, roughly, that every brick other than the Petersen graph can be generated from a “matchin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1989
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90282-f